Probing convex polygons with half-planes
نویسندگان
چکیده
منابع مشابه
Probing Convex Polygons with Half-planes1
A half-plane probe through a polygon measures the area of intersection between a half-plane and the polygon. We dev elop techniques based on xray probing to determine convex n-gons in 7n + 7 half-plane probes. We also show n + 1 half-plane probes are sufficient to verify a specified convex polygon and prove linear lower bounds for determination and verification.
متن کاملProbing convex polygons with a wedge
Minimizing the number of probes is one of the main challenges in reconstructing geometric objects with probing devices. In this paper, we investigate the problem of using an ω-wedge probing tool to determine the exact shape and orientation of a convex polygon. An ω-wedge consists of two rays emanating from a point called the apex of the wedge and the two rays forming an angle ω. A valid ω-probe...
متن کاملModel-based Probing Strategies for Convex Polygons
We prove that n + 4 finger probes are sufficient to determine the shape of a convex n-gon from a finite collection of models, improving the previous result of 2n + 1. Further, we show that n − 1 are necessary, proving this is optimal to within an additive constant. For line probes, we show that 2n + 4 probes are sufficient and 2n − 3 necessary. The difference between these results is particular...
متن کاملMoving Porous Half-Planes
A shear flow motivated by relatively moving half-planes is theoretically studied in this paper. Either the mass influx or the mass efflux is allowed on the boundary. This flow is called the extended Stokes’ problems. Traditionally, exact solutions to the Stokes’ problems can be readily obtained by directly applying the integral transforms to the momentum equation and the associated boundary and...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1991
ISSN: 0196-6774
DOI: 10.1016/0196-6774(91)90009-n